Sorting algorithms

Results: 505



#Item
51Program Calculation Jeremy Gibbons IIJ, Tokyo, February 2015 Program Calculation

Program Calculation Jeremy Gibbons IIJ, Tokyo, February 2015 Program Calculation

Add to Reading List

Source URL: seminar-materials.iijlab.net

Language: English - Date: 2015-02-24 22:29:26
52Practical Massively Parallel Sorting – Basic Algorithmic Ideas Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz arXiv:1410.6754v1 [cs.DS] 24 Oct 2014

Practical Massively Parallel Sorting – Basic Algorithmic Ideas Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz arXiv:1410.6754v1 [cs.DS] 24 Oct 2014

Add to Reading List

Source URL: panthema.net

Language: English - Date: 2014-10-27 01:32:39
536.006 Intro to Algorithms  QUIZ 1 REVIEW NOTES - Part 3 March 8, 2011

6.006 Intro to Algorithms QUIZ 1 REVIEW NOTES - Part 3 March 8, 2011

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-03-08 23:05:09
54How invariants help writing loops Author: Sander Kooijmans Document version: 1.2 Why this document? Did you ever feel frustrated because of a nasty bug in your code? Did

How invariants help writing loops Author: Sander Kooijmans Document version: 1.2 Why this document? Did you ever feel frustrated because of a nasty bug in your code? Did

Add to Reading List

Source URL: gogognome.nl

Language: English - Date: 2016-07-04 14:55:09
55348  IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5,

348 IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5,

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:21
56Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 A simple algorithm to solve this problem is sorting both sets A and B and then doing a linear scan to check for common elements. We start fr

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 A simple algorithm to solve this problem is sorting both sets A and B and then doing a linear scan to check for common elements. We start fr

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-02 15:25:03
57Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗  Christoph Lenzen

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:02
58Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes Marcus Fontoura1∗, Vanja Josifovski2 , Jinhui Liu2 , Srihari Venkatesan2 , Xiangfei Zhu2 , Jason Zien2 1. Google Inc., 1600 Amphitheatre Pkw

Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes Marcus Fontoura1∗, Vanja Josifovski2 , Jinhui Liu2 , Srihari Venkatesan2 , Xiangfei Zhu2 , Jason Zien2 1. Google Inc., 1600 Amphitheatre Pkw

Add to Reading List

Source URL: fontoura.org

Language: English - Date: 2011-08-25 01:23:47
59Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-03-14 16:00:21
60Microsoft Word - Auditing Algorithms -- Sandvig -- ICA 2014 Data and Discrimination Preconference.docx

Microsoft Word - Auditing Algorithms -- Sandvig -- ICA 2014 Data and Discrimination Preconference.docx

Add to Reading List

Source URL: social.cs.uiuc.edu

Language: English - Date: 2015-10-08 22:46:00